12 research outputs found

    On the number of minimal completely separating systems and antichains in a Boolean lattice

    Get PDF
    An (n)completely separating system C ((n)CSS) is a collection of blocks of [n] = {1,..., n} such that for all distinct a, b ∈ [n] there are blocks A, B ∈C with a ∈ A \ B and b ∈ B \ A. An (n)CSS is minimal if it contains the minimum possible number of blocks for a CSS on [n]. The number of non-isomorphic minimal (n)CSSs is determined for 11 ≤ n ≤ 35. This also provides an enumeration of a natural class of antichains

    On the number of minimal completely separating systems and antichains in a Boolean lattice

    No full text
    An (n)completely separating system C ((n)CSS) is a collection of blocks of [n] = {1,...,n} such that for all distinct a, b Є C with a Є A B and b Є B A. An (n)CSS is minimal if it contains the minimum possible number of blocks for a CSS on [n]. The number of non-isomorphic minimal (n)CSSs is determined for 11 ≤ n ≤ 35. This also provides an enumeration of a natural class of antichains

    Wordplay in Shakespeare's Hamlet and the Accusation of Derrida's “Logical Phallusies”

    No full text
    That “Derrida's writing borders on being unreadable” has been maintained by several academics, journalists and students. This essay considers this reaction to Jacques Derrida's writing in relation to a broader history of wordplay and puns. Using Shakespeare's Hamlet as a starting point followed by the infamous letter to The Times that accused Derrida of “logical phallusies”, it argues that if Derrida's writing does border on being unreadable, then, this is the condition of all writing. The essay suggests that rather than suppressing the spectres of Derrida in Shakespeare studies, we should welcome back the aspects of his work that help us to “read and write in the space or heritage of Shakespeare”
    corecore